Linear-Nondeterminism Linear Advice for the P-Selective Sets

نویسندگان

  • Lane A. Hemaspaandra
  • Christopher Nasipak
  • Keith Parkins
چکیده

Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasilinear nondeterminism. We extend this by showing that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets

Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasilinear nondeterminism. We show that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism.

متن کامل

Algebraic Properties for Selector Functions

The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regarding the deterministic advice complexity of the P-selective sets—i.e., the amount of Karp– Lipton advice needed for polynomial-time machines to recognize them in general—the best current upper bound is quadratic [Ko83] and the best current lower bound is linear [HT96]. We prove that every associat...

متن کامل

Optimal Advice

Ko Ko83] proved that the P-selective sets are in the advice class P/quadratic. We prove that the P-selective sets are in NP=linear T coNP=linear. We show this to be optimal in terms of the amount of advice needed.

متن کامل

Linear v{C}ech closure spaces

In this paper, we introduce the concept of linear v{C}ech closure spaces and establish the properties of open sets in linear v{C}ech closure spaces (Lv{C}CS). Here, we observe that the concept of linearity is preserved by semi-open sets, g-semi open sets, $gamma$-open sets, sgc-dense sets and compact sets in Lv{C}CS. We also discuss the concept of relative v{C}ech closure operator, meet and pro...

متن کامل

Remotality and proximinality in normed linear spaces

In this paper, we consider the concepts farthest points and nearest points in normed linear spaces, We obtain a necessary and coecient conditions for proximinal, Chebyshev, remotal and uniquely remotal subsets in normed linear spaces. Also, we consider -remotality, -proximinality, coproximinality and co-remotality.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997